Strong edge antimagic total labeling on multistar
نویسندگان
چکیده
منابع مشابه
On super edge-antimagic total labeling of subdivided stars
In 1980, Enomoto et al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In this paper, we give a partial support for the correctness of this conjecture by formulating some super (a, d)edge-antimagic total labelings on a subclass of subdivided stars denoted by T (n, n + 1, 2n + 1, 4n + 2, n5, n6, . . . , nr) for different values of the edgeantimagic labeling...
متن کاملNew Construction on Edge-Antimagic Labeling
An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of vertices and edges to 1, 2, . . . , p+ q such that for every edge the sums of the label of the edge and the label of its two end vertices are constant. Otherwise if the sum is distinct, it is said to be an edge-antimagic total labeling. A graph is called edgeantimagic if it admits edge-antimagic t...
متن کاملOn super (a, d)-edge antimagic total labeling of certain families of graphs
A (p, q)-graph G is (a, d)-edge antimagic total if there exists a bijection f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge weights Λ(uv) = f(u) + f(uv) + f(v), uv ∈ E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2, . . . , p} and the edge labels are {p+ 1, p+ 2, . . . ,...
متن کاملOn super (a, d)-edge-antimagic total labeling of disconnected graphs
A graph G of order p and size q is called (a, d)-edge-antimagic total if there exists a bijection f : V(G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge-weights, w(uv) = f(u) + f (v) + f (uv), uv ∈ E(G), form an arithmetic sequence with the first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study supe...
متن کاملOn Super (a, d)-Edge-Antimagic Total Labeling of Special Types of Crown Graphs
For a graph G = (V, E), a bijection f from V(G) ∪ E(G) → {1, 2, . . . , |V(G)| + |E(G)|} is called (a, d)-edge-antimagic total ((a, d)EAT) labeling of G if the edge-weights w(xy) = f(x) + f(y) + f(xy), xy ∈ E(G), form an arithmetic progression starting from a and having a common difference d, where a > 0 and d ≥ 0 are two fixed integers. An (a, d)-EAT labeling is called super (a, d)-EAT labelin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1778/1/012009